منابع مشابه
The Extended Λ-method for Controlled Lagrangian Systems
This paper extends the λ-method, which was developed in (Auckly et al., 2000; Auckly and Kapitanski, 2003) to solve effectively PDE’s involved in the method of controlled Lagrangian systems, by taking into account a gyroscopic term. The gyroscopic force provides more free parameters when one designs stabilizing controllers in the method of controlled Lagrangian systems. We illustrate the extend...
متن کاملAn augmented Lagrangian method for distributed optimization
We propose a novel distributed method for convex optimization problems with a certain separability structure. The method is based on the augmented Lagrangian framework. We analyze its convergence and provide an application to two network models, as well as to a two-stage stochastic optimization problem. The proposed method compares favorably to two augmented Lagrangian decomposition methods kno...
متن کاملOptimality properties of an Augmented Lagrangian method
Sometimes, the feasible set of an optimization problem that one aims to solve using a Nonlinear Programming algorithm is empty. In this case, two characteristics of the algorithm are desirable. On the one hand, the algorithm should converge to a minimizer of some infeasibility measure. On the other hand, one may wish to find a point with minimal infeasibility for which some optimality condition...
متن کاملExtended Hqeft Lagrangian and Currents *
From the tree-level heavy quark effective Lagrangian keeping particle-antiparticle mixed sectors we derive the vector current coupling to a hard gluonic field allowing for heavy quark-antiquark pair annihilation and creation. 1. A COMPLETE TREE-LEVEL HQEFT LAGRANGIAN In this work we keep both heavy quark and heavy antiquark coupled sectors in the HQEFT Lagrangian. To our knowledge, until [1] on...
متن کاملLagrangian Relaxation and Partial Cover (Extended Abstract)
Lagrangian relaxation has been used extensively in the design of approximation algorithms. This paper studies its strengths and limitations when applied to Partial Cover. We show that for Partial Cover in general no algorithm that uses Lagrangian relaxation and a Lagrangian Multiplier Preserving (LMP) α-approximation as a black box can yield an approximation factor better than 4 3 α. This match...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational Physics
سال: 1995
ISSN: 0021-9991
DOI: 10.1006/jcph.1995.1100